New Complexity - PDFSEARCH.IO - Document Search Engine

New Complexity
Results: 348

#	Item
221	Discrepancy Bounds for Mixed Sequences Michael Gnewuch Department of Computer Science, Columbia University, 1214 Amsterdam Avenue, MC 0401, New York, 10027 NY, USA email: [removed] Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2009-12-01 06:17:11 Applied mathematics Diophantine approximation Probabilistic complexity theory Low-discrepancy sequence Quasi-Monte Carlo method Monte Carlo method Randomized algorithm Mathematics Randomness Numerical analysis
222	Minimal Randomness and Information Theory Sergio Verd6 Dept. Electrical Engineering, Princeton University, Princeton, New Jersey 08544, USA Abstract - This is a tutorial survey of recent information theoretic results dea Add to Reading List Source URL: www.princeton.edu Language: English - Date: 2005-09-08 15:10:40 Information Cryptography Knowledge Communication Information Age Rate–distortion theory Entropy Complexity Information theory Randomness Science
223	LOGARITHMIC LOWER BOUNDS IN THE CELL-PROBE MODEL∗ ˇ MIHAI PATRAS ¸ CU† AND ERIK D. DEMAINE† Abstract. We develop a new technique for proving cell-probe lower bounds on dynamic data structures. This technique enab Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2008-09-07 01:08:29 Big O notation Mathematical notation LG Corp Computational complexity theory Ordinal number Analysis of algorithms Mathematics Asymptotic analysis
224	Optimal discovery with probabilistic expert advice S´ebastien Bubeck1 , Damien Ernst2 and Aur´elien Garivier3 Abstract— Motivated by issues of security analysis for power systems, we analyze a new problem, called opt Add to Reading List Source URL: www.princeton.edu Language: English - Date: 2012-07-22 16:22:45 Estimation theory Signal processing Statistical inference PP Algorithm SL Uniform distribution Applied mathematics Mathematics Quantum complexity theory
225	NEW CONCEPTS IN COMPLEXITY THEORY arising from studies in the field of architecture an overview of the four books of Add to Reading List Source URL: katarxis3.com Language: English - Date: 2010-07-21 09:34:23 Systems Cybernetics Complex systems theory Theories of truth Complexity Complex systems Emergence Truth Coherence theory of truth Science Knowledge Ethology
226	Scientists identify a new layer of complexity within colon cancer Add to Reading List Source URL: medicalxpress.com Language: English - Date: 2015-02-25 17:54:52 Biotechnology Carcinogenesis Oncology Cancer research Cancer Stem cell Colorectal cancer John Dick Chemotherapy Medicine Biology Stem cells
227	BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 42, Number 1, Pages 3–38 S[removed][removed]Article electronically published on September 30, 2004 Add to Reading List Source URL: www.ams.org Language: English - Date: 2010-01-14 12:40:23 Cryptography Integer sequences Finite fields Modular arithmetic Complexity classes AKS primality test Prime number Integer factorization NP Mathematics Primality tests Number theory
228	100 SETH LLOYD creates new bits of information, bits which previously did not exist. In other words, quantum mechanics, via decoherence, is constantly Add to Reading List Source URL: spiritualscientific.com Language: English - Date: 2011-03-28 09:40:16 Information theory Randomness Models of computation Cryptography Quantum computer Seth Lloyd Algorithmic information theory Quantum mechanics Complexity Applied mathematics Science Theoretical computer science
229	Workshop Materials: Algorithmic Accountability The Social, Cultural & Ethical Dimensions of “Big Data” March 17, [removed]New York, NY Brief Description Accountability is fundamentally about checks and balances to powe Add to Reading List Source URL: pacscenter.stanford.edu Language: English - Date: 2014-06-24 13:27:55 Theoretical computer science Mathematics Applied mathematics Computational complexity theory Machine learning Algorithms Science Cybernetics Algorithm Mathematical logic
230	Improved Quantum Query Complexity Bounds for Some Graph Problems Prafulla Dhariwal, Vinay Mayar Abstract We prove improved quantum query complexity bounds for some graph problem. Our results are based on a new quantum al Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-12-25 20:29:06 NP-complete problems Matching Combinatorial optimization Graph coloring Vertex cover Bipartite graph Adjacency matrix Independent set Shortest path problem Graph theory Mathematics Theoretical computer science

UPDATE